Motion Planning for Highly Constrained Spaces
نویسندگان
چکیده
We introduce a sampling-based motion planning method that automatically adapts to the difficulties caused by thin regions in the free space (not necessarily narrow corridors). These problems arise frequently in settings such as closedchain manipulators, humanoid motion planning, and generally any time bodies are in contact or maintain close proximity with each other. Our method combines the aggressive exploration properties of RRTs, the adaptive sampling domain of DDRRTs, and the intrinsic dimensionality-reduction properties of kd-trees to focus the sampling and searching in the appropriate subspaces. We handle closed-chains and other kinds of constraints in a general way that avoids inverse kinematics computations, if desired. We have implemented the method and show its computational advantages on a variety of challenging examples.
منابع مشابه
Constrained Motion Planning in Discrete State Spaces
We propose a principled method to create a search space for constrained motion planning, which efficiently encodes only feasible motion plans. The space of possible paths is encoded implicitly in the connections between states, but only feasible and only local connections are allowed. Furthermore, we propose a systematic method to generate a near-minimal set of spatially distinct motion alterna...
متن کاملA Penalty Function Method for Constrained Motion Planning
The path planning problem, i.e. the geometrical problem of finding a collision-free path between two given configurations of a robot moving among obstacles, has been studied by many authors in recent years. The interest in constrained motion planning is more recent. Constrained motion planning consists in finding motion sequences for robotic systems whose free space in not an open subset of the...
متن کاملLearning to Plan for Constrained Manipulation from Demonstrations
Motion planning in high dimensional state spaces, such as for mobile manipulation, is a challenging problem. Constrained manipulation, e.g. opening articulated objects like doors or drawers, is also hard since sampling states on the constrained manifold is expensive. Further, planning for such tasks requires a combination of planning in free space for reaching a desired grasp or contact locatio...
متن کاملPath Planning on Manifolds Using Randomized Higher-Dimensional Continuation
Despite the significant advances in path planning methods, problems involving highly constrained spaces are still challenging. In particular, in many situations the configuration space is a non-parametrizable variety implicitly defined by constraints, which complicates the successful generalization of sampling-based path planners. In this paper, we present a new path planning algorithm speciall...
متن کاملViewing Motion Planning as Disassembly: A Decomposition-Based Approach for Non-Stationary Robots
An efficient single-query motion planning approach for non-stationary robots is presented. The approach exploits workspace information to identify highly constrained placements of the robot along a potential solution path. Due to the constraints imposed by the environment at these placements, we view them as an assembly, consisting of the robot and the environment. The original motion planning ...
متن کامل